0.06/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.06/0.13 % Command : run_E %s %d THM 0.13/0.33 % Computer : n028.cluster.edu 0.13/0.33 % Model : x86_64 x86_64 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.33 % Memory : 8042.1875MB 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 0.13/0.33 % CPULimit : 960 0.13/0.33 % WCLimit : 120 0.13/0.33 % DateTime : Tue Aug 9 03:54:05 EDT 2022 0.13/0.33 % CPUTime : 0.18/0.46 Running higher-order on 8 cores theorem proving 0.18/0.46 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=120 /export/starexec/sandbox2/benchmark/theBenchmark.p 0.18/0.46 # Version: 3.0pre003-ho 23.60/3.44 # Preprocessing class: HSMSSMSSSSSNHHA. 23.60/3.44 # Scheduled 6 strats onto 8 cores with 120 seconds (960 total) 23.60/3.44 # Starting full_lambda_6 with 360s (3) cores 23.60/3.44 # Starting post_as_ho1 with 120s (1) cores 23.60/3.44 # Starting lpo6_lambda_fix with 120s (1) cores 23.60/3.44 # Starting ho_unfolding_1 with 120s (1) cores 23.60/3.44 # Starting new_ho_10_unif with 120s (1) cores 23.60/3.44 # Starting ho_unfolding_2 with 120s (1) cores 23.60/3.44 # lpo6_lambda_fix with pid 27096 completed with status 0 23.60/3.44 # Result found by lpo6_lambda_fix 23.60/3.44 # Preprocessing class: HSMSSMSSSSSNHHA. 23.60/3.44 # Scheduled 6 strats onto 8 cores with 120 seconds (960 total) 23.60/3.44 # Starting full_lambda_6 with 360s (3) cores 23.60/3.44 # Starting post_as_ho1 with 120s (1) cores 23.60/3.44 # Starting lpo6_lambda_fix with 120s (1) cores 23.60/3.44 # No SInE strategy applied 23.60/3.44 # Search class: HGHNF-FFSF22-SHHFFSBN 23.60/3.44 # Scheduled 6 strats onto 1 cores with 120 seconds (120 total) 23.60/3.44 # Starting new_ho_10_unif with 36s (1) cores 23.60/3.44 # new_ho_10_unif with pid 27102 completed with status 0 23.60/3.44 # Result found by new_ho_10_unif 23.60/3.44 # Preprocessing class: HSMSSMSSSSSNHHA. 23.60/3.44 # Scheduled 6 strats onto 8 cores with 120 seconds (960 total) 23.60/3.44 # Starting full_lambda_6 with 360s (3) cores 23.60/3.44 # Starting post_as_ho1 with 120s (1) cores 23.60/3.44 # Starting lpo6_lambda_fix with 120s (1) cores 23.60/3.44 # No SInE strategy applied 23.60/3.44 # Search class: HGHNF-FFSF22-SHHFFSBN 23.60/3.44 # Scheduled 6 strats onto 1 cores with 120 seconds (120 total) 23.60/3.44 # Starting new_ho_10_unif with 36s (1) cores 23.60/3.44 # Preprocessing time : 0.001 s 23.60/3.44 # Presaturation interreduction done 23.60/3.44 23.60/3.44 # Proof found! 23.60/3.44 # SZS status Theorem 23.60/3.44 # SZS output start CNFRefutation 23.60/3.44 thf(decl_22, type, epred1_0: a > a > $o). 23.60/3.44 thf(decl_23, type, esk1_0: (a > $o) > a). 23.60/3.44 thf(decl_24, type, esk2_2: (a > $o) > a > a). 23.60/3.44 thf(decl_25, type, esk3_0: a > a). 23.60/3.44 thf(cTHM145_B_pme, conjecture, ![X1:a > a > $o, X2:(a > $o) > a]:(((![X3:a, X4:a, X5:a]:((((X1 @ X4 @ X5)&(X1 @ X3 @ X4))=>(X1 @ X3 @ X5)))&![X6:a > $o]:(((![X5:a]:(((X1 @ X5 @ (X2 @ X6))<=(X6 @ X5)))&![X5:a]:(((X6 @ X5)=>(X1 @ X5 @ (X2 @ X6)))))&![X7:a]:((![X8:a]:(((X1 @ X8 @ X7)<=(X6 @ X8)))=>(X1 @ (X2 @ X6) @ X7))))))=>![X9:a > a]:(((![X3:a, X4:a]:(((X1 @ X3 @ X4)=>(X1 @ (X9 @ X3) @ (X9 @ X4))))&![X3:a, X4:a]:(((X1 @ (X9 @ X3) @ (X9 @ X4))<=(X1 @ X3 @ X4))))=>?[X10:a]:(((X1 @ (X9 @ X10) @ X10)&(X1 @ X10 @ (X9 @ X10)))))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', cTHM145_B_pme)). 23.60/3.44 thf(c_0_1, negated_conjecture, ~(![X1:a > a > $o, X2:(a > $o) > a]:(((![X3:a, X4:a, X5:a]:((((X1 @ X4 @ X5)&(X1 @ X3 @ X4))=>(X1 @ X3 @ X5)))&![X6:a > $o]:((![X5:a]:(((X6 @ X5)=>(X1 @ X5 @ (X2 @ X6))))&![X7:a]:((![X8:a]:(((X6 @ X8)=>(X1 @ X8 @ X7)))=>(X1 @ (X2 @ X6) @ X7))))))=>![X9:a > a]:((![X3:a, X4:a]:(((X1 @ X3 @ X4)=>(X1 @ (X9 @ X3) @ (X9 @ X4))))=>?[X10:a]:(((X1 @ (X9 @ X10) @ X10)&(X1 @ X10 @ (X9 @ X10))))))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM145_B_pme])])). 23.60/3.44 thf(c_0_2, negated_conjecture, ![X29:a, X30:a, X31:a, X32:a > $o, X33:a, X34:a, X37:a, X38:a, X39:a]:((((~(epred1_0 @ X30 @ X31)|~(epred1_0 @ X29 @ X30)|(epred1_0 @ X29 @ X31))&((~(X32 @ X33)|(epred1_0 @ X33 @ (esk1_0 @ X32)))&(((X32 @ (esk2_2 @ X32 @ X34))|(epred1_0 @ (esk1_0 @ X32) @ X34))&(~(epred1_0 @ (esk2_2 @ X32 @ X34) @ X34)|(epred1_0 @ (esk1_0 @ X32) @ X34)))))&((~(epred1_0 @ X37 @ X38)|(epred1_0 @ (esk3_0 @ X37) @ (esk3_0 @ X38)))&(~(epred1_0 @ (esk3_0 @ X39) @ X39)|~(epred1_0 @ X39 @ (esk3_0 @ X39)))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])). 23.60/3.44 thf(c_0_3, negated_conjecture, ![X5:a, X4:a, X3:a]:(((epred1_0 @ X5 @ X4)|~((epred1_0 @ X3 @ X4))|~((epred1_0 @ X5 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_2])). 23.60/3.44 thf(c_0_4, negated_conjecture, ![X6:a > $o, X3:a]:(((X6 @ (esk2_2 @ X6 @ X3))|(epred1_0 @ (esk1_0 @ X6) @ X3))), inference(split_conjunct,[status(thm)],[c_0_2])). 23.60/3.44 thf(c_0_5, negated_conjecture, ![X3:a, X21:a > a, X9:a > a, X4:a]:(((epred1_0 @ (X9 @ (esk2_2 @ (^[Z0:a]:((epred1_0 @ (X9 @ Z0) @ (X21 @ Z0)))) @ X3)) @ X4)|(epred1_0 @ (esk1_0 @ (^[Z0:a]:((epred1_0 @ (X9 @ Z0) @ (X21 @ Z0))))) @ X3)|~((epred1_0 @ (X21 @ (esk2_2 @ (^[Z0:a]:((epred1_0 @ (X9 @ Z0) @ (X21 @ Z0)))) @ X3)) @ X4)))), inference(spm,[status(thm)],[c_0_3, c_0_4])). 23.60/3.44 thf(c_0_6, negated_conjecture, ![X3:a, X4:a]:(((epred1_0 @ (esk3_0 @ X3) @ (esk3_0 @ X4))|~((epred1_0 @ X3 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_2])). 23.60/3.44 thf(c_0_7, negated_conjecture, ![X6:a > $o, X3:a]:(((epred1_0 @ X3 @ (esk1_0 @ X6))|~((X6 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_2])). 23.60/3.44 thf(c_0_8, negated_conjecture, ![X3:a, X21:a > a, X9:a > a, X4:a]:(((epred1_0 @ (X9 @ (esk2_2 @ (^[Z0:a]:((epred1_0 @ (X9 @ Z0) @ (esk3_0 @ (X21 @ Z0))))) @ X3)) @ (esk3_0 @ X4))|(epred1_0 @ (esk1_0 @ (^[Z0:a]:((epred1_0 @ (X9 @ Z0) @ (esk3_0 @ (X21 @ Z0)))))) @ X3)|~((epred1_0 @ (X21 @ (esk2_2 @ (^[Z0:a]:((epred1_0 @ (X9 @ Z0) @ (esk3_0 @ (X21 @ Z0))))) @ X3)) @ X4)))), inference(spm,[status(thm)],[c_0_5, c_0_6])). 23.60/3.44 thf(c_0_9, negated_conjecture, ![X1:a > a > $o, X3:a]:(((epred1_0 @ (esk2_2 @ (^[Z0:a]:((X1 @ Z0 @ Z0))) @ X3) @ (esk1_0 @ (^[Z0:a]:((X1 @ Z0 @ Z0)))))|(epred1_0 @ (esk1_0 @ (^[Z0:a]:((X1 @ Z0 @ Z0)))) @ X3))), inference(spm,[status(thm)],[c_0_7, c_0_4])). 23.60/3.44 thf(c_0_10, negated_conjecture, ![X6:a > $o, X3:a]:(((epred1_0 @ (esk1_0 @ X6) @ X3)|~((epred1_0 @ (esk2_2 @ X6 @ X3) @ X3)))), inference(split_conjunct,[status(thm)],[c_0_2])). 23.60/3.44 thf(c_0_11, negated_conjecture, ![X3:a]:(((epred1_0 @ (esk2_2 @ (^[Z0:a]:((epred1_0 @ Z0 @ (esk3_0 @ Z0)))) @ X3) @ (esk3_0 @ (esk1_0 @ (^[Z0:a]:((epred1_0 @ Z0 @ (esk3_0 @ Z0)))))))|(epred1_0 @ (esk1_0 @ (^[Z0:a]:((epred1_0 @ Z0 @ (esk3_0 @ Z0))))) @ X3))), inference(spm,[status(thm)],[c_0_8, c_0_9])). 23.60/3.44 thf(c_0_12, negated_conjecture, ![X9:a > a, X3:a]:(((epred1_0 @ (esk3_0 @ X3) @ (esk1_0 @ (^[Z0:a]:((epred1_0 @ Z0 @ (esk3_0 @ (X9 @ Z0)))))))|~((epred1_0 @ X3 @ (X9 @ (esk3_0 @ X3)))))), inference(spm,[status(thm)],[c_0_7, c_0_6])). 23.60/3.44 thf(c_0_13, negated_conjecture, (epred1_0 @ (esk1_0 @ (^[Z0:a]:((epred1_0 @ Z0 @ (esk3_0 @ Z0))))) @ (esk3_0 @ (esk1_0 @ (^[Z0:a]:((epred1_0 @ Z0 @ (esk3_0 @ Z0))))))), inference(spm,[status(thm)],[c_0_10, c_0_11])). 23.60/3.44 thf(c_0_14, negated_conjecture, ![X3:a]:((~((epred1_0 @ (esk3_0 @ X3) @ X3))|~((epred1_0 @ X3 @ (esk3_0 @ X3))))), inference(split_conjunct,[status(thm)],[c_0_2])). 23.60/3.44 thf(c_0_15, negated_conjecture, (epred1_0 @ (esk3_0 @ (esk1_0 @ (^[Z0:a]:((epred1_0 @ Z0 @ (esk3_0 @ Z0)))))) @ (esk1_0 @ (^[Z0:a]:((epred1_0 @ Z0 @ (esk3_0 @ Z0)))))), inference(spm,[status(thm)],[c_0_12, c_0_13])). 23.60/3.44 thf(c_0_16, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14, c_0_15]), c_0_13])]), ['proof']). 23.60/3.44 # SZS output end CNFRefutation 23.60/3.44 # Parsed axioms : 2 23.60/3.44 # Removed by relevancy pruning/SinE : 0 23.60/3.44 # Initial clauses : 7 23.60/3.44 # Removed in clause preprocessing : 1 23.60/3.44 # Initial clauses in saturation : 6 23.60/3.44 # Processed clauses : 878 23.60/3.44 # ...of these trivial : 170 23.60/3.44 # ...subsumed : 209 23.60/3.44 # ...remaining for further processing : 499 23.60/3.44 # Other redundant clauses eliminated : 0 23.60/3.44 # Clauses deleted for lack of memory : 0 23.60/3.44 # Backward-subsumed : 41 23.60/3.44 # Backward-rewritten : 58 23.60/3.44 # Generated clauses : 50845 23.60/3.44 # ...of the previous two non-redundant : 46357 23.60/3.44 # ...aggressively subsumed : 0 23.60/3.44 # Contextual simplify-reflections : 1 23.60/3.44 # Paramodulations : 50682 23.60/3.44 # Factorizations : 162 23.60/3.44 # NegExts : 0 23.60/3.44 # Equation resolutions : 1 23.60/3.44 # Propositional unsat checks : 0 23.60/3.44 # Propositional check models : 0 23.60/3.44 # Propositional check unsatisfiable : 0 23.60/3.44 # Propositional clauses : 0 23.60/3.44 # Propositional clauses after purity: 0 23.60/3.44 # Propositional unsat core size : 0 23.60/3.44 # Propositional preprocessing time : 0.000 23.60/3.44 # Propositional encoding time : 0.000 23.60/3.44 # Propositional solver time : 0.000 23.60/3.44 # Success case prop preproc time : 0.000 23.60/3.44 # Success case prop encoding time : 0.000 23.60/3.44 # Success case prop solver time : 0.000 23.60/3.44 # Current number of processed clauses : 394 23.60/3.44 # Positive orientable unit clauses : 73 23.60/3.44 # Positive unorientable unit clauses: 0 23.60/3.44 # Negative unit clauses : 14 23.60/3.44 # Non-unit-clauses : 307 23.60/3.44 # Current number of unprocessed clauses: 45044 23.60/3.44 # ...number of literals in the above : 140874 23.60/3.44 # Current number of archived formulas : 0 23.60/3.44 # Current number of archived clauses : 105 23.60/3.44 # Clause-clause subsumption calls (NU) : 12683 23.60/3.44 # Rec. Clause-clause subsumption calls : 10842 23.60/3.44 # Non-unit clause-clause subsumptions : 239 23.60/3.44 # Unit Clause-clause subsumption calls : 2109 23.60/3.44 # Rewrite failures with RHS unbound : 0 23.60/3.44 # BW rewrite match attempts : 1969 23.60/3.44 # BW rewrite match successes : 62 23.60/3.44 # Condensation attempts : 878 23.60/3.44 # Condensation successes : 4 23.60/3.44 # Termbank termtop insertions : 11934626 23.60/3.44 23.60/3.44 # ------------------------------------------------- 23.60/3.44 # User time : 2.855 s 23.60/3.44 # System time : 0.106 s 23.60/3.44 # Total time : 2.961 s 23.60/3.44 # Maximum resident set size: 1736 pages 23.60/3.47 EOF